Duality and saddle-point type optimality for generalized nonlinear fractional programming
نویسندگان
چکیده
منابع مشابه
Optimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملA study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming
This paper is concerned with the study of necessary and sufficient optimality conditions for convex–concave generalized fractional disjunctive programming problems for which the decision set is the union of a family of convex sets. The Lagrangian function for such problems is defined and the Kuhn–Tucker Saddle and Stationary points are characterized. In addition, some important theorems related...
متن کاملOptimality and Duality for Minimax Fractional Semi-Infinite Programming
The purpose of this paper is to consider a class of nonsmooth minimax fractional semi-infinite programming problem. Based on the concept of H − tangent derivative, a new generalization of convexity, namely generalized uniform ( , ) H B ρ − invexity, is defined for this problem. For such semi-infinite programming problem, several sufficient optimality conditions are established and proved by uti...
متن کاملOptimality and duality for the multiobjective fractional programming with the generalized (F,ρ) convexity
A class of multiobjective fractional programmings (MFP) are first formulated, where the involved functions are local Lipschitz and Clarke subdifferentiable. In order to deduce our main results, we give the definitions of the generalized (F,ρ) convex class about the Clarke subgradient. Under the above generalized convexity assumption, the alternative theorem is obtained, and some sufficient and ...
متن کاملOPTIMALITY AND DUALITY FOR MULTIOBJECTIVE FRACTIONAL PROGRAMMING PROBLEMS WITH n-SET FUNCTIONS AND GENERALIZED V -TYPE-I UNIVEXITY
Problems of multiobjective optimization are widespread in mathematical modelling of real world systems for a very broad range of applications. In particular, several classes of multiobjective problems with set and n-set functions have been the subject of several papers in the last few decades. For a historical survey of optimality conditions and duality for programming problems involving set an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2004
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2003.08.029